Quasi-Monte Carlo integration using digital nets with antithetics
نویسندگان
چکیده
منابع مشابه
Error bounds for quasi-Monte Carlo integration with nets
We analyze the error introduced by approximately calculating the s-dimensional Lebesgue measure of a Jordan-measurable subset of Is = [0, 1)s. We give an upper bound for the error of a method using a (t,m, s)-net, which is a set with a very regular distribution behavior. When the subset of Is is defined by some function of bounded variation on Īs−1, the error is estimated by means of the variat...
متن کاملGeneralized Haar Function Systems, Digital Nets and Quasi-monte Carlo Integration
SPIE 2762, and is made available as an electronic reprint with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, or distribution to multiple locations through an electronic listserver or other electronic means, or duplication of any material in this paper for a fee or for commercial purposes is prohibited. By choosing t...
متن کاملTHE b-ADIC SYMMETRIZATION OF DIGITAL NETS FOR QUASI-MONTE CARLO INTEGRATION
ABSTRACT. The notion of symmetrization, also known as Davenport’s reflection principle, is well known in the area of the discrepancy theory and quasiMonte Carlo (QMC) integration. In this paper we consider applying a symmetrization technique to a certain class of QMC point sets called digital nets over Zb. Although symmetrization has been recognized as a geometric technique in the multi-dimensi...
متن کاملDigital Nets and Sequences Discrepancy Theory and Quasi-Monte Carlo Integration
Indispensable for students, invaluable for researchers, this comprehensive treatment of contemporary quasi–Monte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in research. As deterministic versions of the Monte Carlo method, quasi–Monte Carlo rules have increased in...
متن کاملMonte-Carlo and Quasi-Monte-Carlo Methods for Numerical Integration
We consider the problem of numerical integration in dimension s, with eventually large s; the usual rules need a very huge number of nodes with increasing dimension to obtain some accuracy, say an error bound less than 10−2; this phenomenon is called ”the curse of dimensionality”; to overcome it, two kind of methods have been developped: the so-called Monte-Carlo and Quasi-Monte-Carlo methods. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2016.02.048